Solving polynomials by radicals with roots of unity in minimum depth
نویسندگان
چکیده
Let k be an algebraic number field. Let α be a root of a polynomial f ∈ k[x] which is solvable by radicals. Let L be the splitting field of α over k. Let n be a natural number divisible by the discriminant of the maximal abelian subextension of L, as well as the exponent of G(L/k), the Galois group of L over k. We show that an optimal nested radical with roots of unity for α can be effectively constructed from the derived series of the solvable Galois group of L(ζn) over k(ζn).
منابع مشابه
Math 121 Notes: a Field Guide to Galois Theory
1. Vector Spaces: 1/7/13 1 2. Review of Math 120 I: Planting Seeds: 1/9/13 3 3. Review of Math 120 II: Harvesting Consequences: 1/11/13 4 4. Extending Fields by Adjoining Roots of Irreducible Polynomials: 1/14/13 5 5. Splitting Fields and Algebraic Closures: 1/16/13 6 6. Searching for Closure: 1/18/13 7 7. Separable Field Extensions: 1/23/13 9 8. Finite Fields and Roots of Unity: 1/25/13 10 9. ...
متن کاملNonlinear Difference Equations with Periodic Solutions
For ten nonlinear difference equations with only p-periodic solutions it is shown that the characteristic polynomials of the corresponding linearized equations about the equilibria have only zeros which are p-th roots of unity. An analogous result is shown concerning two systems of such equations. Five counterexamples show that the reverse is not true. Some remarks are made concerning equations...
متن کاملGreen polynomials at roots of unity and its application
We consider Green polynomials at roots of unity. We obtain a recursive formula for Green polynomials at appropriate roots of unity, which is described in a combinatorial manner. The coefficients of the recursive formula are realized by the number of permutations satisfying a certain condition, which leads to interpretation of a combinatorial property of certain graded modules of the symmetric g...
متن کاملSolving algebraic equations in roots of unity
This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called maximal torsion cosets. We obtain new explicit upper bounds for the number of maximal torsion cosets on an algebraic subvariety of the complex algebraic n-to...
متن کاملSolution of Bang-Bang Optimal Control Problems by Using Bezier Polynomials
In this paper, a new numerical method is presented for solving the optimal control problems of Bang-Bang type with free or fixed terminal time. The method is based on Bezier polynomials which are presented in any interval as $[t_0,t_f]$. The problems are reduced to a constrained problems which can be solved by using Lagrangian method. The constraints of these problems are terminal state and con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 1999